"Patch on Demand" Saves Even More Time?
نویسنده
چکیده
I n the June 2004 Security column (" A Patch in Nine Saves Time? " pp. 82-83), Bill Arbaugh makes two interesting observations: first, whoever has the tightest observe-orient-decide-act (OODA) loop will prevail in a confrontation; second, the infection rates of recent worms suggest that the good guys are losing the battle. Arbaugh offers some sensible suggestions to vendors and security professionals on improving patch management. However, the best indication that we are losing the battle is not the infection rates of worms such as Slammer and Blaster, but the shrinking interval between discovering and announcing a new vulnerability and the appearance of a worm or attack that exploits it. The most recent example is the Witty worm, which effectively exploited a vulnerability present in a small population of hosts—approxi-mately 12,000 computers. Although it was first discovered on 8 March 2004, the vendor didn't announce the vulnerability until 18 March, after it had made a patch available. A little over a day after the announcement, Witty made its first appearance. Given such a short turnaround time, we can reasonably expect to soon experience a zero-day worm. Zero-day attacks are those for which users receive no prior warning and thus have no preventive measures in place. To date, a combination of aggressive packet filtering and proactive application patching could—at least in prin-ciple—defeat all the worms we have encountered. Although we could, in theory, deploy patches and network filters automatically, the practicality of employing such measures and their effect on regular system operation are an entirely different story. Witty came close to being a zero-day worm; for most organizations, it was. Few system administrators had even seen the announcement before the attack, much less downloaded and installed the necessary software patch. Furthermore, as Arbaugh (" Windows of Vulnerability: A Case Study of Analysis, " Computer, Dec. 2000, pp. 52-59) and others such as Eric Rescorla (" Security Holes … Who Cares? " Proc. 12th Usenix Security Symp., Usenix, 2003, pp. 75-90) have noted, many administrators find it impractical, if not otherwise unacceptable, to patch or upgrade their systems when a vulnerability is announced. Instead, they wait for news of an actual exploitation. In many cases, this is simply too late. What to do then? One new idea is to integrate the vulnerability discovery, patch generation, and patch application cycles into a system that would automatically detect a new attack, analyze its modus …
منابع مشابه
Development of Video On Demand Server Based on LiveMedia and Improved Cycle Patch Algorithm
The disadvantage of patching algorithm is that the generating multicast flow disorder and cycle patch algorithm solved the above problems. Improved Batch processing cycle patch algorithm has better treatment effect for large scale emergency request, and has a good effect in demand on demand for hot programs or prime time, can effectively increase the number of users. The main function of the Li...
متن کاملA Fast Strategy to Find Solution for Survivable Multicommodity Network
This paper proposes an immediately efficient method, based on Benders Decomposition (BD), for solving the survivable capacitated network design problem. This problem involves selecting a set of arcs for building a survivable network at a minimum cost and within a satisfied flow. The system is subject to failure and capacity restriction. To solve this problem, the BD was initially proposed with ...
متن کاملMeasuring the Impact of Non-economic Exogenous Factors on Industrial Energy Demand in Iran
This paper tries to demonstrate the importance of non-economic exogenous factors (Underlying Energy Demand Trend) when we estimate the industrial energy demand for Iran. The Structural Time Series Model (STSM) approach is used to model these unobservable factors. The Kalman filter and Maximum Likelihood methods allow us to estimate the value of the UEDT. This approach enables us to obtain more ...
متن کاملA Novel Caching Strategy in Video-on-Demand (VoD) Peer-to-Peer (P2P) Networks Based on Complex Network Theory
The popularity of video-on-demand (VoD) streaming has grown dramatically over the World Wide Web. Most users in VoD P2P networks have to wait a long time in order to access their requesting videos. Therefore, reducing waiting time to access videos is the main challenge for VoD P2P networks. In this paper, we propose a novel algorithm for caching video based on peers' priority and video's popula...
متن کاملA Novel Caching Strategy in Video-on-Demand (VoD) Peer-to-Peer (P2P) Networks Based on Complex Network Theory
The popularity of video-on-demand (VoD) streaming has grown dramatically over the World Wide Web. Most users in VoD P2P networks have to wait a long time in order to access their requesting videos. Therefore, reducing waiting time to access videos is the main challenge for VoD P2P networks. In this paper, we propose a novel algorithm for caching video based on peers' priority and video's popula...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- IEEE Computer
دوره 37 شماره
صفحات -
تاریخ انتشار 2004